ALMOST SELF-CENTERED MEDIAN AND CHORDAL GRAPHS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Almost Self-centered Median and Chordal Graphs

Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is m...

متن کامل

Constructing Almost Peripheral and Almost Self-centered Graphs Revisited

The center and the periphery of a graph is the set of vertices with minimum resp. maximum eccentricity in it. A graph is almost self-centered (ASC) if it contains exactly two non-central vertices and is almost peripheral (AP) if all its vertices but one lie in the periphery. Answering a question from (Taiwanese J. Math. 18 (2014), 463–471) it is proved that for any integer r ≥ 1 there exists an...

متن کامل

Characterizing almost-median graphs II

Let M, A, S, and P, be the sets of median graphs, almost-median graphs, semi-median graphs and partial cubes, respectively. Then M ⊂ A ⊂ S ⊂ P. It is proved that a partial cube is almost-median if and only if it contains no convex cycle of length greater that four. This extends the result of Brešar [2] who proved that the same property characterizes almost-median graphs within the class of semi...

متن کامل

Characterisation of self-complementary chordal graphs

In this note we prove that a self-complementary graph with p vertices is chordal if and only if its clique number is integral part of (p + 1)/2. (~) 1998 Elsevier Science B.V. All rights reserved

متن کامل

On almost self-complementary graphs

A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc − I, where Xc denotes the complement of X and I a perfect matching (1-factor) in Xc. Almost self-complementary circulant graphs were first studied by Dobson and Šajna in 2004. In this paper we investigate some of the properties and constructions of general almost self-complementary graphs. In par...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Taiwanese Journal of Mathematics

سال: 2012

ISSN: 1027-5487

DOI: 10.11650/twjm/1500406804